Constrained Graph Drawing
نویسنده
چکیده
II Teile dieser Arbeit basieren auf Veröffentlichungen, die aus der Zusammenar-beit mit anderen Wissenschaftlerinnen und Wissenschaftlern entstanden sind. Zu allen diesen Inhalten wurden wesentliche Beiträge geleistet. Baumträger haben und ein Algorithmus, um einen solchen effizient zu berechnen, falls er existiert.
منابع مشابه
Topology Preserving Constrained Graph Layout
Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like ...
متن کاملStraight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Any outerplanar graph of n vertices with maximum degree d has a straight-line grid drawing with area O(dn log n). In this paper, we introduce a subclass of outerplanar graphs, which we call ...
متن کاملA Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction
The one-sided two-level crossing reduction problem is an important problem in hierarchical graph drawing. Because of its NPhardness there are many heuristics, such as the well-known barycenter and median heuristics. We consider the constrained one-sided two-level crossing reduction problem, where the relative position of certain vertex pairs on the second level is fixed. Based on the barycenter...
متن کاملConstrained Stress Majorization Using Diagonally Scaled Gradient Projection
Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly improve the speed and convergence properties of the constrained stress-majorization technique for graph layout by employing a diagonal scaling of the stress function. Diagonal scaling requires the active-set quadratic programming ...
متن کاملConstrained graph layout by stress majorization and gradient projection
The adoption of the stress-majorization method from multi-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we explore algorithms for augmenting such stress-majorization techniques with simple linear constraints using gradient-projection optimization techniques. O...
متن کامل